#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
char ans[maxn];
int main(void)
{
  	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n,m;cin>>n>>m;
        for(LL i=0;i<=n+10;i++) str[i]=ans[i]='/0';
        cin>>(str+1);
        for(LL i=1;i<=(m-1)*2;i++){
            if(i&1) ans[i]='(';
            else ans[i]=')';
        }
        LL pos1=(m-1)*2;
        for(LL i=pos1+1;i<=pos1+n/2-(m-1);i++){
            ans[i]='(';
        }
        LL pos2=pos1+n/2-(m-1);
        for(LL i=pos2+1;i<=n;i++){
            ans[i]=')';
        }
//        for(LL i=1;i<=n;i++){
//            cout<<ans[i];
//        }
//        cout<<"\n";
        vector<pair<LL,LL>>v;
        for(LL l=1;l<=n;l++){
            if(str[l]!=ans[l]){
                LL r=l;
                char p[maxn];LL tot=0;
                for(r=l;r<=n;r++){
                    if(str[r]==ans[l]){
                        p[++tot]=str[r];
                        break;
                    }
                    else p[++tot]=str[r];
                }
                v.push_back({l,r});
                for(LL k=l;k<=r;k++){
                    str[k]=p[tot--];
                }
//                cout<<"\n";
//                for(LL i=1;i<=n;i++){
//                    cout<<str[i];
//                }
//                cout<<"\n";
            }
        }
        cout<<v.size()<<"\n";
        for(auto i:v){
            cout<<i.first<<" "<<i.second<<"\n";
        }
    }
return 0;
}
